////#include<iostream>
////#include<algorithm>
////const int N = 1e6 + 10;
////typedef long long ll;
////ll a[N];
////using namespace std;
////int main()
////{
////	ll n, m;cin >> n >> m;
////	for (int i = 1; i <= n; i++)
////	{
////		cin >> a[i];
////	}
////	sort(a + 1, a + 1 + n);ll sum = 0,ret = 0,ans = 0;
////	for (ll i = a[n]; i >= 0; i--)
////	{
////		sum = 0;
////		for (ll j = 1; j <= n; j++)
////		{
////			ll t = a[j] - i;
////			if (t <= 0) continue;
////			else sum += t;
////		}
////		
////		
////	}
////	cout << ret << endl;
////	return 0;
////}
//#include<iostream>
//#include<algorithm>
//const int N = 1e7 + 10;
//typedef long long ll;
//ll a[N],n;
//using namespace std;
//ll calcul(ll x)
//{
//	ll sum = 0;
//	for (ll i = 1; i <= n; i++)
//	{
//		ll t = a[i] - x;
//		if (t <= 0) continue;
//		sum += t;
//	}
//	return sum;
//}
//int main()
//{
//	ll  m;cin >> n >> m;
//	for (int i = 1; i <= n; i++)
//	{
//		cin >> a[i];
//	}
//	sort(a + 1, a + 1 + n);
//	ll left = 1, right = a[n];
//	while (left < right)
//	{
//		ll mid = (right + left + 1) / 2;
//		if (calcul(mid) >= m) left = mid;
//		else right = mid - 1;
//	}
//	cout << left << endl;
//	return 0;
//}
//#include<stdio.h>
//int main()
//{
//	float a = 3.7253;
//	printf("%.2f\n", a);
//	printf("%7.2f", a);
//	return 0;
//}